Locally Correct Fréchet Matchings
نویسندگان
چکیده
The Fréchet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Fréchet distance a Fréchet matching. There are often many different Fréchet matchings and not all of these capture the similarity between the curves well. We propose to restrict the set of Fréchet matchings to “natural” matchings and to this end introduce locally correct Fréchet matchings. We prove that at least one such a matching exists for two polygonal curves and give an algorithm to compute it.
منابع مشابه
Measurable Perfect Matchings for Acyclic Locally Countable Borel graphs
We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields the existence of Borel matchings for such graphs of degree at least three. As a corollary, it follows that acyclic locally countable Borel graphs of degree a...
متن کامل6 Smooth K - Theory of Locally Convex Algebras
Smooth K-functors are introduced and the smooth K-theory of locally convex algebras is developed. It is proved that the algebraic and smooth K-functors are isomorphic on the category of quasi ⊗̂-stable real (or complex) Fréchet algebras.
متن کاملPayoff Kinks in Preferences Over Lotteries
This paper identifies two distinct types of payoff kinks that can be exhibited by preference functions over monetary lotteries—“locally separable” vs. “locally nonseparable”—and illustrates their relationship to the payoff and probability derivatives of such functions. Expected utility and Fréchet differentiable preference functions are found to be incapable of exhibiting locally nonseparable p...
متن کاملNonlinear Optimization for Human-Like Movements of a High Degree of Freedom Robotics Arm-Hand System
Optimizing the Layout of Proportional Symbol Maps p. 1 An Optimal Hidden-Surface Algorithm and Its Parallelization p. 17 Construction of Pseudo-triangulation by Incremental Insertion p. 30 Non-uniform Geometric Matchings p. 44 Multi-robot Visual Coverage Path Planning: Geometrical Metamorphosis of the Workspace through Raster Graphics Based Approaches A Practical Solution for Aligning and Simpl...
متن کاملMaximum Locally Stable Matchings
Motivated by the observation that most companies are more likely to consider job applicants suggested by their employees than those who apply on their own, Arcaute and Vassilvitskii modeled a job market that integrates social networks into stable matchings in an interesting way. We call their model HR+SN because an instance of their model is an ordered pair (I,G) where I is a typical instance o...
متن کامل